Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
241	The International Olympiad in Informatics Syllabus 1 Version and status information Add to Reading List Source URL: ioinformatics.org Language: English - Date: 2013-10-04 02:55:48 Computer programming Software engineering Mathematics Recursion Theoretical computer science Operations research Computability theory International Olympiad in Informatics International Science Olympiad Algorithm Sorting algorithm Computational complexity theory
242	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
243	The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K. Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2013-10-30 13:41:09 Computational complexity theory Complexity classes Theory of computation PPAD Reduction LemkeHowson algorithm Algorithm NP PSPACE-complete P True quantified Boolean formula
244	Popular articles April 12, L´ aszl´ o Babai. E-mail and the unexpected power of interaction. In Proc. 5th IEEE Conf. on Structure in Complexity Theory (SCT’90), pages 30–44. Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 05:05:39 Babai Aga
245	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:42 Computational complexity theory Theory of computation Complexity classes Polynomial-time approximation scheme BPP Time complexity NP NC
246	ALGORITHMIC LINEAR DIMENSION REDUCTION IN THE `1 NORM FOR SPARSE VECTORS A. C. GILBERT, M. J. STRAUSS, J. A. TROPP, AND R. VERSHYNIN Abstract. We can recover approximately a sparse signal with limited noise, i.e, a vecto Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2009-02-03 14:30:47 Digital signal processing Computational complexity theory Matrix Fast Fourier transform Time complexity Mathematics Computer science Theoretical computer science Polynomials
247	Chapter 1 MINING AND USING SETS OF PATTERNS THROUGH COMPRESSION Matthijs van Leeuwen KU Leuven Leuven, Belgium Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2014-12-31 10:52:18 Algorithmic information theory Information theory Cybernetics Formal sciences Theoretical computer science Statistics Minimum description length Statistical theory Lossless compression Minimum message length Data compression Kolmogorov complexity
248	arXiv:1511.07147v1 [cs.LG] 23 NovA PAC Approach to Application-Specific Algorithm Selection∗ Rishi Gupta Tim Roughgarden Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-11-23 20:51:24 Mathematics Computational complexity theory Applied mathematics NP-complete problems Combinatorial optimization Operations research Mathematical optimization Machine learning Algorithm Greedy algorithm Heuristic Knapsack problem
249	Span-Program-Based Quantum Algorithm for Evaluating Formulas Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2014-11-14 13:01:33 Theoretical computer science Quantum computing Theory of computation Mathematics Computational complexity theory Quantum algorithm Quantum information science Algorithm FO
250	Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Mathematics Computational complexity theory Geometry Polygons NP-complete problems Euclidean plane geometry Art gallery problem Computational geometry Vertex APX

UPDATE